Parameterized Complexity of Superstring Problems
نویسندگان
چکیده
منابع مشابه
Parameterized Complexity of Geometric Problems
This paper surveys parameterized complexity results for NP-hard geometric problems. Geometric problems arise frequently in application domains as diverse as computer graphics [19], computer vision [4, 35, 43], VLSI design [64], geographic information systems [73, 30], graph drawing [72], and robotics [65, 37], and typically involve (sets of) geometric objects, such as, points, line segments, ba...
متن کاملParameterized Complexity of Weak Odd Domination Problems
Given a graph G = (V,E), a subset B ⊆ V of vertices is a weak odd dominated (WOD) set if there exists D ⊆ V \B such that every vertex in B has an odd number of neighbours in D. κ(G) denotes the size of the largest WOD set, and κ′(G) the size of the smallest non-WOD set. The maximum of κ(G) and |V | − κ′(G), denoted κQ(G), plays a crucial role in quantum cryptography. In particular deciding, giv...
متن کاملParameterized Complexity of Cardinality Constrained Optimization Problems
We study the parameterized complexity of cardinality constrained optimization problems, i.e. optimization problems that require their solutions to contain specified numbers of elements to optimize solution values. For this purpose, we consider around 20 such optimization problems, as well as their parametric duals, that deal with various fundamental relations among vertices and edges in graphs....
متن کاملParameterized Complexity of Edge Interdiction Problems
We study the parameterized complexity of graph interdiction problems. For an optimization problem on graphs, one can formulate an interdiction problem as a game consisting of two players, namely, an interdictor and an evader, who compete on an objective with opposing interests. In edge interdiction problems, every edge of the input graph has an interdiction cost associated with it and the inter...
متن کاملThe Parameterized Complexity of Counting Problems
We develop a parameterized complexity theory for counting problems. As the basis of this theory, we introduce a hierarchy of parameterized counting complexity classes #W[t], for t ≥ 1, that corresponds to Downey and Fellows’s W-hierarchy [13] and show that a few central W-completeness results for decision problems translate to #W-completeness results for the corresponding counting problems. Cou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2016
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-016-0193-0